Decremental Single-Source Reachability and Strongly Connected Components in Õ(m√n) Total Update Time
نویسندگان
چکیده
We present randomized algorithms with a total update time of Õ(m √ n) for the problems of decremental singlesource reachability and decremental strongly connected components on directed graphs. This improves recent breakthrough results of Henzinger, Krinninger and Nanongkai [STOC 14, ICALP 15]. In addition, our algorithms are arguably simpler. Keywords-dynamic algorithm; single-source reachability; strongly connected components
منابع مشابه
Simple and Faster algorithm for Reachability in a Decremental Directed Graph
We consider the problem of maintaining source sink reachability(st-Reachability), single source reachability(SSR) and strongly connected component(SCC) in an edge decremental directed graph. In particular, we design a randomized algorithm that maintains with high probability1: 1. st-Reachability in Õ(mn) total update time2. 2. st-Reachability in a total update time of Õ(n) in a dense graph. 3. ...
متن کاملImproved Algorithms for Decremental Single-Source Reachability on Directed Graphs
Recently we presented the first algorithm for maintaining the set of nodes reachable from a source node in a directed graph that is modified by edge deletions with o(mn) total update time, where m is the number of edges and n is the number of nodes in the graph [Henzinger et al. STOC 2014]. The algorithm is a combination of several different algorithms, each for a different m vs. n trade-off. F...
متن کاملFinding Strongly Connected Components in Parallel using O(log n) Reachability Queries
We give a randomized (Las-Vegas) parallel algorithm for computing strongly connected components of a graph with n vertices andm edges. The runtime is dominated byO(log n) multi-source parallel reachability queries; i.e. O(log n) calls to a subroutine that computes the union of the descendants of a given set of vertices in a given digraph. Our algorithm also topologically sorts the strongly conn...
متن کاملDeterministic Partially Dynamic Single Source Shortest Paths in Weighted Graphs
In this paper we consider the decremental single-source shortest paths (SSSP) problem, where given a graph G and a source node s the goal is to maintain shortest distances between s and all other nodes in G under a sequence of online adversarial edge deletions. In their seminal work, Even and Shiloach [JACM 1981] presented an exact solution to the problem in unweighted graphs with only O(mn) to...
متن کاملDecremental maintenance of strongly connected components
We consider the problem of maintaining the strongly connected components (SCCs) of an n-nodes and medges directed graph that undergoes a sequence of edge deletions. Recently, in SODA 2011, Łącki presented a deterministic algorithm that preprocess the graph in O(mn) time and creates a data structure that maintains the SCCs of a graph under edge deletions with a total update time of O(mn). The da...
متن کامل